AVACS -- Automatic Verification and Analysis of Complex Systems
نویسنده
چکیده
Acyclic phase-type distributions are phase-type distributions with triangular matrix representations. They constitute a versatile modelling tool, since they (1) can serve as approximations to any continuous distributions, and (2) exhibit special properties and characteristics, which usually result in some ease in analysis. The size of the matrix representation has a strong influence on computational efforts needed when analyzing these distributions. This representation, however, is not unique, and two representations of the same distribution can differ drastically in size. This report proposes an effective procedure to aggregate the size of the matrix representation without altering the distribution.
منابع مشابه
Automatic Verification of Real-Time Systems with Rich Data: An Overview
We present an overview of the results of the project “Beyond Timed Automata” of the Collaborative Research Center AVACS (Automatic Verification and Analysis of Complex Systems) during the period 2008–2011, which advances the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time—beyond t...
متن کاملA Semantics for Procedure Local Heaps and its Abstractions AVACS-TR-1
The goal of this work is to develop compile-time algorithms for automaticallyverifying properties of imperative programs that manipulate dynamically allocatedstorage. The paper presents an analysis method that uses a characterization of aprocedure’s behavior in which parts of the heap not relevant to the procedure areignored. The paper has two main parts: The first part introduc...
متن کاملConstraint-Based Analysis of Concurrent Probabilistic Hybrid Systems: An Application to Networked Automation Systems
In previous publications, the authors have introduced the notion of stochastic satisfiability modulo theories (SSMT) and the corresponding SiSAT solving algorithm, which provide a symbolic method for the reachability analysis of probabilistic hybrid systems. SSMT extends satisfiability modulo theories (SMT) with randomized (or stochastic), existential, and universal quantification, as known fro...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFully symbolic TCTL model checking for complete and incomplete real-time systems
In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems. We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables. Besides complete networks of FSMTs our algorithm can verify incomplete real-time systems in form of incomplete FSMTs, and i...
متن کامل